Infinite limits of the duplication model and graph folding
نویسندگان
چکیده
We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model. We characterize the isomorphism type and induced subgraph structure of these infinite graphs using the notion of dismantlability from the theory of vertex pursuit games, and graph homomorphisms.
منابع مشابه
Infinite Limits of Stochastic Graph Models - Draft
We present new generalized copying models for massive self-organizing networks such as the web graph, and analyze their limit behaviour. Our model is motivated by a desire to unify common design elements of the copying models of the web graph, and the partial duplication model for biological networks. In these models, new nodes copy (with some error) the link structure of existing nodes, and a ...
متن کاملLimit behaviour of models for the web graph and other self-organizing networks
We present a new generalized copying model for massive self-organizing networks such as the web graph, and analyze its limit behaviour. Our model is motivated by a desire to unify common design elements of the copying models of the web graph, and the partial duplication model for biological networks. In these models, new nodes copy (with some error) the link structure of existing nodes, and a c...
متن کاملSpectra of Some New Graph Operations and Some New Class of Integral Graphs
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.
متن کاملInfinite Limits of Copying Models of the Web Graph
Several stochastic models were proposed recently to model the dynamic evolution of the web graph. We study the infinite limits of the stochastic processes proposed to model the web graph when time goes to infinity. We prove that deterministic variations of the so-called copying model can lead to several nonisomorphic limits. Some models converge to the infinite random graph R, while the converg...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997